Graph colorings, flows and arithmetic Tutte polynomial
نویسندگان
چکیده
منابع مشابه
The multivariate arithmetic Tutte polynomial
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two. We provide a generalized Fortuin-Kasteleyn representation for representable arithmetic matroids, with applications to arithmetic colorings and flows. We give a new proof of the positivity of the coefficients of the arithmetic Tutte polynomi...
متن کاملGraph invariants, homomorphisms, and the Tutte polynomial
There are various ways to define the chromatic polynomial P (G; z) of a graph G. Perhaps the first that springs to mind is to define it to be the graph invariant P (G; k) with the property that when k is a positive integer P (G; k) is the number of colourings of the vertices of G with k or fewer colours such that adjacent vertices receive different colours. One then has to prove that P (G; k) i...
متن کاملMultiparking Functions, Graph Searching, and the Tutte Polynomial
A parking function of length n is a sequence (b1, b2, . . . , bn) of nonnegative integers for which there is a permutation π ∈ Sn so that 0 ≤ bπ(i) < i for all i. A well-known result about parking functions is that the polynomial Pn(q), which enumerates the complements of parking functions by the sum of their terms, is the generating function for the number of connected graphs by the number of ...
متن کاملGraph Polynomials and Their Applications I: The Tutte Polynomial
We begin our exploration of graph polynomials and their applications with the Tutte polynomial, a renown tool for analyzing properties of graphs and networks. This two-variable graph polynomial, due to W. T. Tutte [Tut47,Tut54, Tut67], has the important universal property that essentially any multiplicative graph invariant with a deletion/contraction reduction must be an evaluation of it. These...
متن کاملThe Tutte polynomial and the generalized Petersen graph
GraphsG andH are T -equivalent if they have the same Tutte polynomial. G is T -unique if any arbitrary graph H being T -equivalent to G implies that H is isomorphic to G. We show that the generalized Petersen graph P (m, 2) and the line graph of P (m, 2) are T -unique. 1 The Tutte Polynomial Let G be a graph with vertex set V and edge set E, and let G[A] denote the subgraph ofG induced by the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2013
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2012.06.009